Sifting Informative Examples from a Random Source
نویسنده
چکیده
We discuss two types of algorithms for selecting relevant examples that have been developed in the context of computation learning theory. The examples are selected out of a stream of examples that are generated independently at random. The rst two algorithms are the so-called \boosting" algorithms of Schapire Schapire, 1990] and Fre-und Freund, 1990], and the Query-by-Committee algorithm of Seung Seung et al., 1992]. We describe the algorithms and some of their proven properties, point to some of their commonalities, and suggest some possible future implications.
منابع مشابه
Para-active learning
Training examples are not all equally informative. Active learning strategies leverage this observation in order to massively reduce the number of examples that need to be labeled. We leverage the same observation to build a generic strategy for parallelizing learning algorithms. This strategy is effective because the search for informative examples is highly parallelizable and because we show ...
متن کاملLinear Sifting of Decision Diagrams yChristoph
We propose a new algorithm, called linear sifting, for the optimization of decision diagrams that combines the ee-ciency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples , and that in many cases it leads to substantially more compact diagrams when compared to simple variable reordering. We show in what sense linear transformation...
متن کاملMINCE: A Static Global Variable-Ordering for SAT Search and BDD Manipulation
The increasing popularity of SAT and BDD techniques in formal hardware verification and automated synthesis of logic circuits encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponential in the worst-case, the structure of real-world instances is a natural source of improvements. While SAT and BDD techniques are often presented as mutually exclusive alter...
متن کاملExact and Heuristic Minimization of Determinant Decision Diagrams
Determinant Decision Diagram (DDD) is a variant of binary decision diagrams (BDDs) for representing symbolic matrix determinants and cofactors in symbolic circuit analysis. DDD-based symbolic analysis algorithms have time and space complexities proportional to the number of DDD vertices. Inspired by the ideas of Rudell, Drechsler, et. al. on BDD minimization, we present lowerbound based exact a...
متن کاملUncertainty Based Selection of Learning Experiences
The training experiences needed by a learning system may be selected by either an external agent or the system itself. We show that knowledge of the current state of the learner's representation, which is not available to an external agent, is necessary for selection of informative experiences. Hence it is advantageous if a learning system can select its own experiences. We show that the uncert...
متن کامل